Multi-parent Recombination in Genetic Algorithms with Search Space Boundary Extension by Mirroring
نویسنده
چکیده
Abstract. In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination with center of mass crossover (CMX) seems a good choice for real coded GAs. But CMX does not work well on functions which have their optimum on the corner of the search space. In this paper, we propose a method named boundary extension by mirroring (BEM) to cope with this problem. Applying BEM to CMX, the performance of CMX on the test functions which have their optimum on the corner of the search space was much improved. Further, by applying BEM, we observed clear improvement in performance of two-parent recombination on the functions which have their optimum on the corner of the search space. Thus, we suggest that BEM is a good general technique to improve the efficiency of crossover operators in real-coded GAs for a wide range of functions.
منابع مشابه
Search space boundary extension method in real-coded genetic algorithms
In real-coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we have proposed a boundary extension methods which allows individuals to be located within a limited space beyond the boundary of the search space. In this paper, we give an analysis of the boundary extension methods fro...
متن کاملSampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we have proposed boundary extension methods which allows individuals to be located within a limited space beyond the boundary of the search space. In this paper, we give an analysis of the boundary extension methods from ...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملSolving a Multi-Item Supply Chain Network Problem by Three Meta-heuristic Algorithms
The supply chain network design not only assists organizations production process (e.g.,plan, control and execute a product’s flow) but also ensure what is the growing need for companies in a longterm. This paper develops a three-echelon supply chain network problem including multiple plants, multiple distributors, and multiple retailers with amulti-mode demand satisfaction policy inside of pro...
متن کاملAn Empirical Investigation of Multi - ParentRecombination Operators in EvolutionStrategiesA
1 Abstract An extension of evolution strategies to multi-parent recombina-tion involving a variable number % of parents to create an oospring individual is proposed. The extension is experimentally evaluated on a test suite of functions diierring in their modality, separability and the regular, respectively irregular arrangement of their local optima. Multi-parent diagonal crossover, uniform sc...
متن کامل